Polynomial iteration in characteristic p ∗ †

نویسنده

  • Mei-Chu Chang
چکیده

Let f(x) = ∑d s=0 asx s ∈ Z[x] be a polynomial with ad 6≡ 0 mod p. Take z ∈ Fp and let Oz = {fi(z)}i∈Z+ ⊂ Fp be the orbit of z under f , where fi(z) = f(fi−1(z)) and f0(z) = z. For M < |Oz|, we study the diameter of the partial orbit Oz,M = {z, f(z), f2(z), . . . , fM−1(z)} and prove that diam Oz,M & min { M c log logM , Mp , M 1 2p 1 2 } , where ‘diameter’ is naturally defined in Fp and c depends only on d. For a complete orbit C, we prove that diam C & min{p , e T/4 }, where T is the period of the orbit. ∗2000 Mathematics Subject Classification.Primary 11B50, 37A45, 11B75; Secondary 11T23, 37F10 11G99. †

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

Estimating the Characteristic E X P O N E N T S of Polynomials

1. We consider a polynomial f of degree d _> 2, and we denote its n-th iteration by fn . The results of the theory of iterations that are used in the present article may be found in [1, 2]. A root of the equation f n z = z is called a periodic point (with period n). The quantity X(z) = ~ log I(f~)'(z)l is the characteristic exponent of this point. When the Julia set of the polynomial f is conne...

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

LectureNotes 2006

In this part, we discuss some practical methods for computing eigenvalues and eigenvectors of matrices. Needless to say, we completely avoid trying to solve (or even write down) the characteristic polynomial equation. The very basic power method and its variants, which is based on linear iteration, is used to effectively approximate selected eigenvalues. To determine the complete system of eige...

متن کامل

The characteristic polynomial of a random unitary matrix: a probabilistic approach

In this article, we propose a probabilistic approach to the study of the characteristic polynomial of a random unitary matrix. We recover the Mellin-Fourier transform of such a random polynomial, first obtained by Keating and Snaith in [8] using a simple recursion formula, and from there we are able to obtain the joint law of its radial and angular parts in the complex plane. In particular, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012